Rational iterated function system for positive/monotonic shape preservation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chaotic property for non-autonomous iterated function system

In this paper, the new concept of non-autonomous iterated function system is introduced and also shown that non-autonomous iterated function system IFS(f_(1,∞)^0,f_(1,∞)^1) is topologically transitive for the metric space of X whenever the system has average shadowing property and its minimal points on X are dense. Moreover, such a system is topologically transitive, whenever, there is a point ...

متن کامل

Iterated Function System Quasiarcs

We consider a class of iterated function systems (IFSs) of contracting similarities of Rn, introduced by Hutchinson, for which the invariant set possesses a natural Hölder continuous parameterization by the unit interval. When such an invariant set is homeomorphic to an interval, we give necessary conditions in terms of the similarities alone for it to possess a quasisymmetric (and as a corolla...

متن کامل

Generalized K-Iterated Function System

In 1969, Kannan [1] proved a new mapping which improved the Banach Contraction theorem. The purpose of this paper is to generalize the Kannan mapping and also to prove it, in space of fractals.

متن کامل

Iterated Boolean Games for Rational Verification

Rational verification is the problem of understanding what temporal logic properties hold of a multi-agent system when agents are modelled as players in a game, each acting rationally in pursuit of personal preferences. More specifically, rational verification asks whether a given property, expressed as a temporal logic formula, is satisfied in a computation of the system that might be generate...

متن کامل

Ramification in iterated towers for rational functions

Abstract. Let φ(x) be a rational function of degree > 1 defined over a number field K and let Φn(x, t) = φ (x) − t ∈ K(x, t) where φ(x) is the nth iterate of φ(x). We give a formula for the discriminant of the numerator of Φn(x, t) and show that, if φ(x) is postcritically finite, for each specialization t0 of t to K, there exists a finite set St0 of primes of K such that for all n, the primes d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Difference Equations

سال: 2014

ISSN: 1687-1847

DOI: 10.1186/1687-1847-2014-30